A Temporal Proof Methodology for Reactive Systems
نویسندگان
چکیده
The paper presents a minimal proof theory which is adequate for proving the main important temporal properties of reactive programs. The properties we consider consist of the classes of invariance and response properties. For each of these classes we present a small set of rules that is complete for verifying properties belonging to this class. We illustrate the application of these rules on several examples. We discuss concise presentations of complex proofs using the devices of transition tables and proof diagrams.
منابع مشابه
On the Approximation of Pseudo Linear Systems by Linear Time Varying Systems (RESEARCH NOTE)
This paper presents a modified method for approximating nonlinear systems by a sequence of linear time varying systems. The convergence proof is outlined and the potential of this methodology is discussed. Simulation results are used to show the effectiveness of the proposed method.
متن کاملDiagonal arguments and fixed points
A universal schema for diagonalization was popularized by N.S. Yanofsky (2003), based on a pioneering work of F.W. Lawvere (1969), in which the existence of a (diagonolized-out and contradictory) object implies the existence of a fixed-point for a certain function. It was shown that many self-referential paradoxes and diagonally proved theorems can fit in that schema. Here, we fi...
متن کاملCompleting the Temporal Picture
The paper presents a relatively complete proof system for proving the validity of temporal properties of reactive programs. The presented proof system improves on previous temporal systems, in that it reduces the validity of program properties into pure assertional reasoning, not involving additional temporal reasoning. The proof system is based on the classiication of temporal properties accor...
متن کاملFormal Verification of the Ricart-Agrawala Algorithm
This paper presents the first formal verification of the RicartAgrawala algorithm [RA81] for distributed mutual exclusion of an arbitrary number of nodes. It uses the Temporal Methodology of [MP95a]. We establish both the safety property of mutual exclusion and the liveness property of accessibility . To establish these properties for an arbitrary number of nodes, parameterized proof rules are ...
متن کاملVerification Methods for the Divergent Runs of Clock Systems
We present a methodology for proving temporal properties of the divergent runs of reactive systems with real-valued clocks. A run diverges if time advances beyond any bound. Since the divergent runs of a system may satisfy liveness properties that are not satis ed by some convergent runs, the standard proof rules are incomplete if only divergent runs are considered. First, we develop a sound an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1990